GATE CSE 1997


Q1.

A micro instruction is to be designed to specify: a. none or one of the three micro operations of one kind and b. none or upto six micro operations of another kind The minimum number of bits in the micro-instruction is:
GateOverflow

Q2.

Let T(n) be the function defined by T(1) =1, \: T(n) = 2T (\lfloor \frac{n}{2} \rfloor ) + \sqrt{n} \text{ for } n \geq 2.Which of the following statements is true?
GateOverflow

Q3.

A binary search tree contains the value 1,2,3,4,5,6,7,8. The tree is traversed in pre-order and the values are printed out. Which of the following sequences is a valid output?
GateOverflow

Q4.

The conditional expansion facility of macro processor is provided to
GateOverflow

Q5.

An operating system contains 3 user processes each requiring 2 units of resource R. The minimum number of units of R such that no deadlocks will ever arise is
GateOverflow

Q6.

I/O redirection
GateOverflow

Q7.

Let \left(Z, *\right) be an algebraic structure where Z is the set of integers and the operation * is defined by n*m = \max(n,m). Which of the following statements is true for \left(Z, *\right)?
GateOverflow

Q8.

Let R(a, b, c) and S(d, e, f) be two relations in which d is the foreign key of S that refers to the primary key of R. Consider the following four operations R and S I. Insert into R II. Insert into S III. Delete from R IV. Delete from S Which of the following can cause violation of the referential integrity constraint above?
GateOverflow

Q9.

An N-bit carry lookahead adder, where N is a multiple of 4, employs ICs 74181 (4 bit ALU) and 74182 ( 4 bit carry lookahead generator). The minimum addition time using the best architecture for this adder is
GateOverflow

Q10.

The expression ( a * b) * c \; op \dots where 'op' is one of '+', '*' and '\uparrow' (exponentiation) can be evaluated on a CPU with single register without storing the value of (a * b) if
GateOverflow